Automatically Improving the Anytime Behaviour of Optimisation Algorithms: Supplementary material
نویسندگان
چکیده
Optimisation algorithms with good anytime behaviour try to return as high-quality solutions as possible independently of the computation time allowed. Designing algorithms with good anytime behaviour is a difficult task, because performance is often evaluated subjectively, by plotting the trade-off curve between computation time and solution quality. Yet, the trade-off curve may be modelled also as a set of mutually nondominated, bi-objective points. Using this model, we propose to combine an automatic configuration tool and the hypervolume measure, which assigns a single quality measure to a nondominated set. Our goal is to improve the anytime behaviour of optimisation algorithms by means of automatically finding algorithmic configurations that produce the best nondominated sets. Moreover, the recently proposed weighted hypervolume measure is used here to incorporate the decision-maker’s preferences into the automatic tuning procedure. We report on the improvements reached when applying the proposed method to two relevant scenarios: (i) the design of parameter variation strategies for MAX-MIN Ant System, and (ii) the tuning of the anytime behaviour of SCIP, an open-source mixed integer programming solver with more than 200 parameters. Paper extended version http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2012-012.pdf TSP instances http://iridia.ulb.ac.be/supp/IridiaSupp2012-011/ SCIP instances http://www.cs.ubc.ca/labs/beta/Projects/ParamILS/results.html Please cite this article as: López-Ibáñez, M., & Stützle, T. Automatically improving the anytime behaviour of optimisation algorithms. European Journal of Operational Research, 235(3): 569-582 (2014), doi: 10.1016/j.ejor.2013.10.043 ∗Corresponding author Email addresses: [email protected] (Manuel López-Ibáñez), [email protected] (Thomas Stützle) Please cite this article as: López-Ibáñez, M., & Stützle, T. Automatically improving the anytime behaviour of optimisation algorithms. European Journal of Operational Research, 235(3): 569-582 (2014), doi: 10.1016/j.ejor.2013.10.043 ●● ● ● ● ● ● ● ● ● ● ●● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ●●●● ● ● ● ● ● default whv (xqual) auto anytime
منابع مشابه
Automatically improving the anytime behaviour of optimisation algorithms
Optimisation algorithms with good anytime behaviour try to return as high-quality solutions as possible independently of the computation time allowed. Designing algorithms with good anytime behaviour is a difficult task, because performance is often evaluated subjectively, by plotting the trade-off curve between computation time and solution quality. Yet, the trade-off curve may be modelled als...
متن کاملAutomatically Improving the Anytime Behaviour of Multiobjective Evolutionary Algorithms
Abstract. An algorithm that returns as low-cost solutions as possible at any moment of its execution is said to have a good anytime behaviour. The problem of optimising anytime behaviour can be modelled as a biobjective non-dominated front, where the goal is to minimise both time and cost. Using a unary quality measure such as the hypervolume indicator, the analysis of the anytime behaviour can...
متن کاملDiscrete particle swarm optimisation for ontology alignment
Particle swarm optimisation (PSO) is a biologically-inspired, population-based optimisation technique that has been successfully applied to various problems in science and engineering. In the context of semantic technologies, optimisation problems also occur but have rarely been considered as such. This work addresses the problem of ontology alignment, which is the identification of overlaps in...
متن کاملBounded Anytime Deflation
This paper rearranges a key property of anytime algorithms to derive a technique that determines an admissible lower bound on the minimum solution cost. In conjunction with a class of performance metric known as ‘time-focussed metrics’, the technique can be used to determine when to abort the deflation process within an anytime planning algorithm. The aim of this paper is to exploit this techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014